Eecient Coordination Support with Transputer Systems Eecient Coordination Support with Transputer Systems
نویسندگان
چکیده
With the increasing availability of heterogeneous networks, the coordination of distributed services, the communication between diierent applications, and the development of distributed programs is becoming more and more important. In previous work we proposed coordination extensions for existing sequential programming languages like Prolog and C, leading to Prolog&Co 1 (Prolog plus Coordination) and C&Co (C plus Coordination). The coordination extensions provide ne and coarse grained parallelism, software fault tolerance through function replication, and a high-level, reliable communication via communication objects. The semantics of the base language are not destroyed but only slightly expanded by introducing a few new language constructs. The realization of these new coordination languages employs a coordination kernel running in the background and handling all requests concerning communication with other sites. So far, we have implemented the kernel on single processor workstations in the Internet. As this kernel has to fullll a large number of functions, it may become a bottleneck if many local &Co-systems must be served that involve a lot of internal and external communication. This paper discusses how the coordination kernel can be parallelized and implemented on a transputer architecture. The idea is to have all the time-consuming functions of the kernel running on the transputer with the kernel at the host site stripped to the basic functions, i.e., waiting for requests from remote kernels, and to handle the communication with the local software systems (V P L , C&Co).
منابع مشابه
An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems
This paper presents a new algorithm for the detection and resolution of communication deadlocks in distributed systems. The algorithm is based on some well known concepts for distributed deadlock detection and adds some new features to reduce message-and space complexity. It was implemented on a transputer network and shown to be more eecient than previously published algorithms.
متن کاملIterative Solution Techniques in the FEM on MassivelyParallel
The non-overlapping Domain Decomposition (DD) approach provides a varity of techniques for developing parallel solution strategies for large-scale systems of nite element (f.e.) equations. In the present paper, the use of local multigrid methods in various Dirichlet DD preconditioners is studied. The numerical experiments carried out on a Multicluster{ II-transputer system show that the use of ...
متن کاملAn Enhanced Transputer Server Architecture
This paper describes an Enhanced Transputer Server Architecture (ETSA). The purpose of ETSA is to provide a more flexible and sophisticated environment for interacting with transputer systems than is provided by existing server models. ETSA is a network-based architecture that permits the user of a transputer system to be remote from that system. ETSA supports arbitrary server communication pro...
متن کاملA Parallel Algorithm for Join Operation on Cube Connected Computer
This paper presents a parallel join algorithm on cube connected computer(CCC), where one tuple corresponds to one processing element(PE). First, we shall show that our algorithm takes O(log 2 N) + O(R max log N) using initial sort and eecient broadcasting procedures , where N and R max represent respectively the number of tuples and the maximal subset size which determines the number of iterati...
متن کاملPerformance of Pvm on a Highly Parallel Transputer System
Although PVM was developed to use a network of heterogeneous UNIX computers as a single large parallel computer, it has become an interface for portable programming even on MPP's. We present PVM performance results for a massively parallel transputer system with up to 512 processors. In comparison to an implementation of the same application in the native transputer operating system Parix, we r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994